Meta-Heuristic Algorithms for Solving Hydrothermal System Scheduling Problem Considering Constraints in Transmission Lines
نویسندگان
چکیده
This paper presents the applications of Cuckoo search algorithm (CSA) for solving the problem of optimal power flow for hydrothermal system (OPF-HTS) where IEEE 30-bus test system with both thermal plants and hydropower plants is considered. The problem is first developed in the paper by the combination of optimal power flow (OPF) problem and short-term hydrothermal scheduling (STHTS) problem and it becomes much more complicated than the two sub-problems because it includes all constraints of transmission grid from the comer and all hydraulic constraints from the later in addition to the multi optimal subintervals. In order to validate the performance of the CSA when applied to the problem, another existing meta-heuristic algorithm, Particle swarm optimization has been employed to solve the same problem and compare the obtained results. The analysis on the obtained results has indicated that the CSA is more effective and robust than PSO. Consequently, it can be sated that CSA is a very efficient method for solving the problem.
منابع مشابه
A heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملProject scheduling optimization for contractor’s Net present value maximization using meta-heuristic algorithms: A case study
Today's competitive conditions have caused the projects to be carried out in the least possible time with limited resources. Therefore, managing and scheduling a project is a necessity for the project. The timing of a project is to specify a sequence of times for a series of related activities. According to their priority and their latency, so that between the time the project is completed and ...
متن کاملA Comprehensive Study of Several Meta-Heuristic Algorithms for Open-Pit Mine Production Scheduling Problem Considering Grade Uncertainty
It is significant to discover a global optimization in the problems dealing with large dimensional scales to increase the quality of decision-making in the mining operation. It has been broadly confirmed that the long-term production scheduling (LTPS) problem performs a main role in mining projects to develop the performance regarding the obtainability of constraints, while maximizing the whole...
متن کاملAn imperialist competitive algorithm for solving the production scheduling problem in open pit mine
Production scheduling (planning) of an open-pit mine is the procedure during which the rock blocks are assigned to different production periods in a way that the highest net present value of the project achieved subject to operational constraints. The paper introduces a new and computationally less expensive meta-heuristic technique known as imperialist competitive algorithm (ICA) for long-term...
متن کاملSolving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times
Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...
متن کامل